Dynamic problem

Results: 444



#Item
131Operations research / Complexity classes / NP-complete problems / Approximation algorithm / Optimization problem / Reduction / NP / Knapsack problem / Dynamic programming / Theoretical computer science / Applied mathematics / Computational complexity theory

A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2

Add to Reading List

Source URL: www.cs.technion.ac.il

Language: English - Date: 2012-02-29 12:43:33
132Dynamic programming / Markov processes / Stochastic control / Constraint programming / Constraint satisfaction problem / Actor model / Problem solving / Constraint satisfaction / STRIPS / Statistics / Artificial intelligence / Automated planning and scheduling

Principles of AI Problem Solving Tutorial IJCAI-05 Adnan Darwiche (UCLA, Los Angeles) Rina Dechter (UCI, Irvine) H. Geffner (UPF, Barcelona)

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2008-09-08 14:27:27
133Mathematical optimization / Dynamic programming / Optimal control / Stochastic control / Bellman equation / Markov decision process / Kalman filter / Optimization problem / Secretary problem / Control theory / Statistics / Systems theory

Optimization and Control Richard Weber, Michaelmas Term 2014 Contents Schedules

Add to Reading List

Source URL: www.statslab.cam.ac.uk

Language: English - Date: 2014-11-29 06:04:45
134Operations research / Intermodal containers / Mathematical optimization / Sequence container / Container / Associative containers / Dynamic programming / Berth allocation problem / Transport / C++ Standard Library / Container terminals

The simultaneous reshuffle and yard crane scheduling problem in container terminals Jiao Zhao, Lixin Tang* The Logistics Institute, Northeastern University, Shenyang, 110819, China. Email: , jzha

Add to Reading List

Source URL: www.icms.polyu.edu.hk

Language: English - Date: 2012-05-27 05:10:20
135Analysis of algorithms / NP-complete problems / Operations research / Mathematical optimization / Dynamic programming / Randomized algorithm / Algorithm / Time complexity / Knapsack problem / Theoretical computer science / Computational complexity theory / Applied mathematics

CS 373: Combinatorial Algorithms, Spring 1999 Final Exam (May 7, 1999) Name: Net ID:

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 08:54:06
136Operations research / Theoretical computer science / Combinatorial optimization / Routing algorithms / A* search algorithm / Optimization problem / Dynamic programming / Shortest path problem / Algorithm / Mathematics / Applied mathematics / Search algorithms

Chapter 2 Discrete Planning Steven M. LaValle University of Illinois

Add to Reading List

Source URL: msl.cs.uiuc.edu

Language: English - Date: 2012-04-20 17:07:06
137Systems engineering / Problem frames approach / Systems analysis / Aspect / Requirement / Dynamic programming / Software development / Software requirements / Aspect-oriented software development

Problems, Subproblems and Concerns Position Paper submitted to Early Aspects 2004 Michael Jackson Abstract. Inevitably, aspect-oriented programming has focused on solutions; ‘early aspects’

Add to Reading List

Source URL: mcs.open.ac.uk

Language: English - Date: 2004-01-15 07:39:22
138Computing / R-tree / Segment tree / K-d tree / Measure / B-tree / Interval tree / Fractional cascading / Graph theory / Binary trees / Data management

CCCG 2011, Toronto ON, August 10–12, 2011 A Discrete and Dynamic Version of Klee’s Measure Problem Hakan Yıldız∗ John Hershberger†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:13
139Connectivity / Dynamic programming / Maximum flow problem / Cut / Mathematics / Graph theory / Applied mathematics

Proceedings of IEEE conference on “Computer Vision and Pattern Recognition” (CVPR), 1998 p.648 Markov Random Fields with Efficient Approximations Yuri Boykov

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2004-09-12 22:08:02
140Dynamic programming / Combinatorial optimization / Cryptography / Knapsack problem / Operations research / Algorithm / Baby-step giant-step / Ordinal arithmetic / Mathematics / Theoretical computer science / Applied mathematics

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe∗

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2008-10-28 21:30:52
UPDATE